- source-to-destination path
- 源到目的地通路
English-Chinese computer dictionary (英汉计算机词汇大词典). 2013.
source-to-destination path
Look at other dictionaries:
Path mtu discovery — (PMTUd) est une technique permettant de déterminer, dans un réseau informatique, la taille du MTU sur le chemin entre deux hôtes IP, afin d éviter la fragmentation des paquets. Il est défini pour ICMP par le RFC 1191 et pour ICMPv6 par la RFC… … Wikipédia en Français
Path MTU discovery — (PMTUd) est une technique permettant de déterminer, dans un réseau informatique, la taille du MTU sur le chemin entre deux hôtes IP, afin d éviter la fragmentation des paquets. Il est défini pour ICMP par le RFC 1191 et pour ICMPv6 par la RFC… … Wikipédia en Français
Path length — In chemistry, the path length is defined as the distance that light (UV/VIS) travels through a sample in an analytical cell. Typically, a sample cell is made of quartz, glass, or a plastic rhombic cuvette with a volume typically ranging from 0.1… … Wikipedia
Source routing — In computer networking, source routing allows a sender of a packet to specify the route the packet takes through the network.With source routing the entire path to the destination is known to the sender and is included when sending data. Source… … Wikipedia
Path computation element — Routing is the process of finding a suitable route for conveying data between a source and one or a set of destination. Routing can be subject to a set of constraints, like QoS, policy, or price. Constraint based path computation is a strategic… … Wikipedia
Dynamic Source Routing — (DSR) is a routing protocol for wireless mesh networks. It is similar to AODV in that it forms a route on demand when a transmitting computer requests one. However, it uses source routing instead of relying on the routing table at each… … Wikipedia
Shortest path problem — A graph with 6 vertices and 7 edges In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. An example is… … Wikipedia
Reverse path forwarding — (RPF) is a technique used in modern routers for the purposes of ensuring loop free forwarding of multicast packets in multicast routing and to help prevent IP address spoofing in unicast routing. Contents 1 Multicast RPF 2 Unicast RPF (uRPF) 2.1 … Wikipedia
Open Shortest Path First — (OSPF) is an adaptive routing protocol for Internet Protocol (IP) networks. It uses a link state routing algorithm and falls into the group of interior routing protocols, operating within a single autonomous system (AS). It is defined as OSPF… … Wikipedia
Equal-cost multi-path routing — ECMP can also stand for Electronic Countermeasure Pod.Equal cost multi path routing (ECMP) is a routing strategy where next hop packet forwarding to a single destination can occur over multiple best paths which tie for top place in routing metric … Wikipedia
Shortest-Path — Unter einem kürzesten Pfad versteht man in der Graphentheorie einen Pfad zwischen zwei Knoten u und v, welcher minimale Länge hat. Haben die Kanten im Graphen alle das gleiche Kantengewicht, so ist der kürzeste Pfad äquivalent zu dem Pfad mit den … Deutsch Wikipedia
